Traduzione e analisi delle parole da parte dell'intelligenza artificiale
In questa pagina puoi ottenere un'analisi dettagliata di una parola o frase, prodotta utilizzando la migliore tecnologia di intelligenza artificiale fino ad oggi:
- come viene usata la parola
- frequenza di utilizzo
- è usato più spesso nel discorso orale o scritto
- opzioni di traduzione delle parole
- esempi di utilizzo (varie frasi con traduzione)
- etimologia
unsupervised search - traduzione in olandese
![tree]] representing binary search. The array being searched here is <math>[20, 30, 40, 50, 80, 90, 100]</math>, and the target value is <math>40</math>.](https://commons.wikimedia.org/wiki/Special:FilePath/Binary search example tree.svg?width=200 "tree]] representing binary search. The array being searched here is <math>[20, 30, 40, 50, 80, 90, 100]</math>, and the target value is <math>40</math>.")
![[[Binary search tree]]s are searched using an algorithm similar to binary search.](https://commons.wikimedia.org/wiki/Special:FilePath/Binary search tree search 4.svg?width=200 "[[Binary search tree]]s are searched using an algorithm similar to binary search.")
![Visualization of [[exponential search]]ing finding the upper bound for the subsequent binary search](https://commons.wikimedia.org/wiki/Special:FilePath/Exponential search.svg?width=200 "Visualization of [[exponential search]]ing finding the upper bound for the subsequent binary search")
![In [[fractional cascading]], each array has pointers to every second element of another array, so only one binary search has to be performed to search all the arrays.](https://commons.wikimedia.org/wiki/Special:FilePath/Fractional cascading.svg?width=200 "In [[fractional cascading]], each array has pointers to every second element of another array, so only one binary search has to be performed to search all the arrays.")
![Visualization of [[interpolation search]] using linear interpolation. In this case, no searching is needed because the estimate of the target's location within the array is correct. Other implementations may specify another function for estimating the target's location.](https://commons.wikimedia.org/wiki/Special:FilePath/Interpolation search.svg?width=200 "Visualization of [[interpolation search]] using linear interpolation. In this case, no searching is needed because the estimate of the target's location within the array is correct. Other implementations may specify another function for estimating the target's location.")
![[[Uniform binary search]] stores the difference between the current and the two next possible middle elements instead of specific bounds.](https://commons.wikimedia.org/wiki/Special:FilePath/Uniform binary search.svg?width=200 "[[Uniform binary search]] stores the difference between the current and the two next possible middle elements instead of specific bounds.")
Definizione
Wikipedia
Unsupervised learning is a type of algorithm that learns patterns from untagged data. The goal is that through mimicry, which is an important mode of learning in people, the machine is forced to build a concise representation of its world and then generate imaginative content from it.
In contrast to supervised learning where data is tagged by an expert, e.g. tagged as a "ball" or "fish", unsupervised methods exhibit self-organization that captures patterns as probability densities or a combination of neural feature preferences encoded in the machine's weights and activations. The other levels in the supervision spectrum are reinforcement learning where the machine is given only a numerical performance score as guidance, and semi-supervised learning where a small portion of the data is tagged.
